منابع مشابه
Graphical potential games
We study the class of potential games that are also graphical games with respect to a given graph G of connections between the players. We show that, up to strategic equivalence, this class of games can be identified with the set of Markov random fields on G. From this characterization, and from the Hammersley-Clifford theorem, it follows that the potentials of such games can be decomposed to l...
متن کاملGraphical Potential Games
Potential games, originally introduced in the early 1990’s by Lloyd Shapley, the 2012 Nobel Laureate in Economics, and his colleague Dov Monderer, are a very important class of models in game theory. They have special properties such as the existence of Nash equilibria in pure strategies. This note introduces graphical versions of potential games. Special cases of graphical potential games have...
متن کاملGraphical Games
In this chapter we examine the representational and algorithmic aspects of a class of graph-theoretic models for multiplayer games. Known broadly as graphical games, these models specify restrictions on the direct payoff influences among the player population. In addition to a number of nice computational properties, these models have close connections to well-studied graphical models for proba...
متن کاملNash Equilibrium in Graphical Games and Stochastic Graphical Games
In this paper, graphical games, a compact graphical representation for multi-player game theory is introduced. Various Nash equilibrium computing algorithms for graphical games are reviewed and a naive join tree base approximate Nash equilibrium computing algorithm is proposed. The proposed algorithm can be efficiently used in graphical games with arbitrary underlying structure. Graphical repre...
متن کاملDeterministic Graphical Games Revisited
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving deterministic graphical games and obtain an almost-linear time comparison-based algorithm for computing an equilibrium of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 2016
ISSN: 0022-0531
DOI: 10.1016/j.jet.2016.03.010